Denseness, maximality, and decidability of grammatical families
نویسندگان
چکیده
منابع مشابه
Some Decidability Results on Grammatical Inference and Complexity
The grammatical inference problem is easy to state: One must choose, on the basis of a finite set of symbol strings, a grammar for the language of which the given set is a sample. Precisely the same problem arises in trying to choose a model (theory, function, etc.) to explain a collection of sample data. This is one of the most important information processing problems known and it is surprisi...
متن کاملDecidability of Equality in Categories with Families
Categories with families (cwfs) is a theory which was introduced to be a categorical model of dependently-typed λ-calculus (LF). We first define both theories and discuss about possible variations of the syntax and their consequences; we also see some related theories and see why categories with families is a rather natural one in the sense that it captures the essential constructions of λ-calc...
متن کاملthe effect of task complexity on lexical complexity and grammatical accuracy of efl learners’ argumentative writing
بر اساس فرضیه شناخت رابینسون (2001 و 2003 و 2005) و مدل ظرفیت توجه محدود اسکهان (1998)، این تحقیق تاثیر پیچیدگی تکلیف را بر پیچیدگی واژگان و صحت گرامری نوشتار مباحثه ای 60 نفر از دانشجویان زبان انگلیسی بررسی کرد. میزان پیچیدگی تکلیف از طریق فاکتورهای پراکندگی-منابع تعیین شد. همه ی شرکت کنندگان به صورت نیمه تصادفی به یکی از سه گروه: (1) گروه موضوع، (2) گروه موضوع + اندیشه و (3) گروه موضوع + اندی...
15 صفحه اولDecidability of Chaos for Some Families of Dynamical Systems
We show that existence of positive Lyapounov exponents and/or SRB measures are undecidable (in the algorithmic sense) properties within some parametrized families of interesting dynamical systems: quadratic family and Hénon maps. Because the existence of positive exponents (or SRB measures) is, in a natural way, a manifestation of “chaos”, these results may be understood as saying that the chao...
متن کاملNotions of denseness
The notion of a completely saturated packing [1] is a sharper version of maximum density, and the analogous notion of a completely reduced covering is a sharper version of minimum density. We define two related notions: uniformly recurrent dense packings and diffusively dominant packings. Every compact domain in Euclidean space has a uniformly recurrent dense packing. If the domain self-nests, ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Annales Academiae Scientiarum Fennicae Series A I Mathematica
سال: 1986
ISSN: 0066-1953
DOI: 10.5186/aasfm.1986.1114